Generalizing Dimensionality in Combinatory Categorial Grammar
نویسندگان
چکیده
We extend Combinatory Categorial Grammar (CCG) with a generalized notion of multidimensional sign, inspired by the types of representations found in constraint-based frameworks like HPSG or LFG. The generalized sign allows multiple levels to share information, but only in a resource-bounded way through a very restricted indexation mechanism. This improves representational perspicuity without increasing parsing complexity, in contrast to full-blown unification used in HPSG and LFG. Well-formedness of a linguistic expressions remains entirely determined by the CCG derivation. We show how the multidimensionality and perspicuity of the generalized signs lead to a simplification of previous CCG accounts of how word order and prosody can realize information structure.
منابع مشابه
CCG Chart Realization from Disjunctive Inputs
This paper presents a novel algorithm for efficiently generating paraphrases from disjunctive logical forms. The algorithm is couched in the framework of Combinatory Categorial Grammar (CCG) and has been implemented as an extension to the OpenCCG surface realizer. The algorithm makes use of packed representations similar to those initially proposed by Shemtov (1997), generalizing the approach i...
متن کاملA CCG Fragment of Korean
Combinatory Categorial Grammar is a lexicalised formalism which is mildly context-sensitive. Recently Set Combinatory Categorial Grammar, a direct descendent of Combinatory Categorial Grammar was proposed to treat local scrambling adequately. In this paper, we briefly sketch Set Combinatory Categorial Grammar analyses of various Korean syntactic phenomena including coordination, extraction and ...
متن کاملApplicative and Combinatory Categorial Grammar and Subordinate Constructions in French
In this article we will present a classification and an analysis, by means of Applicative and Combinatory Categorial Grammar (ACCG), of relative, completive and indirect interrogative propositions in French introduced by ”que” and ”qui”. Applicative and Combinatory Categorial Grammar is a generalization of standard Categorial Grammar. It is represented by a canonical association between Steedma...
متن کاملLambek Grammars as Combinatory Categorial Grammars
We propose a combinatory reformulation of the product free version of the categorial calculus LL, i.e. the associative Lambek calculus that admits empty premises. We prove equivalence of the combinatory with the standard Natural Deduction presentation of LL. The result offers a new perspective on the relation between the type logical and the combinatory branch of the Categorial Grammar research...
متن کامل